Two Characterizations of Hypercubes
نویسندگان
چکیده
Two characterizations of hypercubes are given: 1) A graph is a hypercube if and only if it is antipodal and bipartite (0, 2)-graph. 2) A graph is an nhypercube if and only if there are n pairs of prime convexes, the graph is a prime convex intersection graph, and each intersection of n prime convexes (no one of which is from the same pair) is a vertex.
منابع مشابه
Cube intersection concepts in median graphs
In this paper, we study different classes of intersection graphs of maximal hypercubes of median graphs. For a median graph G and k ≥ 0, the intersection graph Qk(G) is defined as the graph whose vertices are maximal hypercubes (by inclusion) in G, and two vertices Hx and Hy in Qk(G) are adjacent whenever the intersection Hx ∩ Hy contains a subgraph isomorphic to Qk. Characterizations of clique...
متن کاملIsometric embeddings of subdivided connected graphs into hypercubes
Isometric subgraphs of hypercubes are known as partial cubes. These graphs have first been investigated by Graham and Pollack [R.L. Graham, H. Pollack, On the addressing problem for loop switching, Bell System Technol. J. 50 (1971) 2495–2519; and D. Djoković, Distance preserving subgraphs of hypercubes, J. Combin. Theory Ser. B 14 (1973) 263–267]. Several papers followed with various characteri...
متن کاملPartial cubes: structures, characterizations, and constructions
Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djoković’s and Winkler’s relations play an important role in the theory of partial cubes. These structures are employed in the paper to characterize bipartite graphs and partial cubes of arbitrary dimension. New characterizations are established and new proofs of some known results are ...
متن کاملAlmost Self-centered Median and Chordal Graphs
Almost self-centered graphs were recently introduced as the graphs with exactly two non-central vertices. In this paper we characterize almost selfcentered graphs among median graphs and among chordal graphs. In the first case P4 and the graphs obtained from hypercubes by attaching to them a single leaf are the only such graphs. Among chordal graph the variety of almost self-centered graph is m...
متن کاملNonfactorizable nonsingular hypercubes
We investigate nonsingular hypercubes, and prove several results, stating a condition for a hypercube to be the product of hypercubes of smaller dimensions. There is a shortage of higher dimensional nonsingular hypercubes in the literature. However, we show that the product of two nonsingular hypercubes is always nonsingular. Then we show how to construct four-dimensional nonsingular hypercubes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011